- hashing on locations
- расстановка по позициям
Англо-русский словарь промышленной и научной лексики. 2014.
hashing on locations
Смотреть что такое "hashing on locations" в других словарях:
Cuckoo hashing — example. The arrows show the alternative location of each key. A new item would be inserted in the location of A by moving A to its alternative location, currently occupied by B, and moving B to its alternative location which is currently vacant … Wikipedia
Geometric hashing — In computer science, geometric hashing is a method for efficiently finding two dimensional objects represented by discrete points that have undergone an affine transformation. (Extensions exist to some other object representations and… … Wikipedia
Double hashing — is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key. It is a popular collision resolution technique in open addressed hash tables. Like… … Wikipedia
Coalesced hashing — example. For purposes of this example, collision buckets are allocated in increasing order, starting with bucket 0. Coalesced hashing, also called coalesced chaining, is a strategy of collision resolution in a hash table that forms a hybrid of… … Wikipedia
directory hashing — A feature of Novell NetWare that indexes file locations on disk, thus speeding file retrieval … Dictionary of networking
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… … Wikipedia
Hash House Harriers — A large scale Hash. A run of the Lima Hash House Harriers in … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
Open addressing — Hash collision resolved by linear probing (interval=1). Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching through alternate locations in… … Wikipedia
Page table — A page table is the data structure used by a virtual memory system in a computer operating system to store the mapping between virtual addresses and physical addresses. Virtual addresses are those unique to the accessing process. Physical… … Wikipedia
